Some Cyclic Solutions to the Three Table Oberwolfach Problem
نویسندگان
چکیده
منابع مشابه
Some Cyclic Solutions to the Three Table Oberwolfach Problem
We use graceful labellings of paths to give a new way of constructing terraces for cyclic groups. These terraces are then used to find cyclic solutions to the three table Oberwolfach problem, OP(r, r, s), where two of the tables have equal size. In particular we show that, for every odd r ≥ 3 and even r with 4 ≤ r ≤ 16, there is a number Nr such that there is a cyclic solution to OP(r, r, s) wh...
متن کاملOberwolfach rectangular table negotiation problem
We completely solve certain case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Let H(k, 3) be a bipartite graph with bipartition X = {x1, x2, . . . , xk}, Y = {y1, y2, . . . , yk} and edges x1 y1, x1 y2, xk yk−1, xk yk , and xi yi−1, xi yi , xi yi+1 for i = 2, 3, . . . , k − 1. We completely characterize all complete bipartite graphs Kn,n ...
متن کاملSolutions to the Oberwolfach problem for orders 18 to 40
The Oberwolfach problem (OP) asks whether Kn (for n odd) or Kn minus a 1-factor (for n even) admits a 2-factorization where each 2-factor is isomorphic to a given 2-factor F . The order n and the type of the 2-factor F are the parameters of the problem. For n ≤ 17, the existence of a solution has been resolved for all possible parameters. There are also many special types of 2-factors for which...
متن کاملSome results on the Oberwolfach problem
The well-known Oberwolfach problem is to show that it is possible to 2-factorize Kn (n odd) or Kn less a 1-factor (n even) into predetermined 2-factors, all isomorphic to each other; a few exceptional cases where it is not possible are known. In this paper we introduce a completely new technique which enables us to show that there is a solution when each 2-factor consists of k r-cycles and one ...
متن کاملSome Solutions to the Ignoring Problem
The ignoring problem refers to the fact that some actions may be infinitely postponed by a state space search algorithm that makes use of partial order reduction (POR). The prevention of this phenomenon is mandatory if one wants to verify more elaborate properties than the deadlock freeness, e.g., safety or liveness properties. We present in this work some solutions to this problem. In order to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1955